منابع مشابه
Auctions vs. fixed pricing: Competing for budget constrained buyers
We investigate price mechanism selection in a setting where sellers compete for budget constrained buyers by adopting either xed pricing or auctions ( rst or second price). We show that rst and second price auctions are payo¤ equivalent when some bidders are nancially constrained, so sellers are indi¤erent to adopt either format. We fully characterize possible equilibria and show that if the...
متن کاملThe Forgetron: A Kernel-Based Perceptron on a Fixed Budget
The Perceptron algorithm, despite its simplicity, often performs well on online classification tasks. The Perceptron becomes especially effective when it is used in conjunction with kernels. However, a common difficulty encountered when implementing kernel-based online algorithms is the amount of memory required to store the online hypothesis, which may grow unboundedly. In this paper we presen...
متن کاملBDUOL: Double Updating Online Learning on a Fixed Budget
Kernel-based online learning often exhibits promising empirical performance for various applications according to previous studies. However, it often suffers a main shortcoming, that is, the unbounded number of support vectors, making it unsuitable for handling large-scale datasets. In this paper, we investigate the problem of budget kernel-based online learning that aims to constrain the numbe...
متن کاملThe treadmill effect in a fixed budget system.
We examine the interaction in the market for physician services when the total budget for reimbursement is fixed. Physicians obtain points for the services they render. At the end of the period the budget is divided by the sum of all points submitted, which determines the price per point. We show that this retrospective payment system involves -- compared to a fee-for-service remuneration syste...
متن کاملFixed budget quantized kernel least-mean-square algorithm
We present a quantization-based kernel least mean square (QKLMS) algorithm with a fixed memory budget. In order to deal with the growing support inherent in online kernel methods, the proposed method utilizes a growing and pruning combined technique and defines a criterion, significance, based on weighted statistical contribution of a data center. This method doesn’t need any apriori informatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature
سال: 1985
ISSN: 0028-0836,1476-4687
DOI: 10.1038/314003b0